OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

A finite element LES methodology for anisotropic in- homogeneous meshes

Large eddy simulation techniques offer a wealth of valuable information for engineering design purposes, but in many cases the required mesh resolution is prohibitive. Combining the dynamic LES procedure with unstructured mesh adaptivity offers a robust and efficient way of capturing the inhomogeneity and anisotropy of complex turbulent flows. However, this may result in a non-vanishing commuta...

Adaptive Multi-Meshes in Finite Element Approximation of Optimal Control

We present some recent developments and issues on adaptive multimesh finite element method, and its applications to computational optimal control. Particularly, we discuss several difficult issues on finite element schemes with adaptive multi-set meshes for parabolic optimal control.

Locally Optimal Unstructured Finite Element Meshes in Three Dimensions

This paper investigates the adaptive finite element solution of a general class of variational problems in three dimensions using a combination of node movement, edge swapping, face swapping and node insertion. The adaptive strategy proposed is a generalization of previous work in two dimensions and is based upon the construction of a hierarchy of locally optimal meshes. Results presented, both...

A Multilevel Approach for Obtaining Locally Optimal Finite Element Meshes

In this paper we consider the adaptive finite element solution of a general class of variational problems using a combination of node insertion, node movement and edge swapping. The adaptive strategy that is proposed is based upon the construction of a hierarchy of locally optimal meshes starting with a coarse grid for which the location and connectivity of the nodes is optimized. This grid is ...

Metaheuristics for the Decomposition of Finite Languages

In this paper, solution methods for the decomposition of a finite language are presented. The goal is to represent a finite language as a product (catenation) of two languages. This problem is thought to be intractable, although its NP-hardness has not been proven. The methods are based on checking through subsets of the states of a minimal acyclic DFA by means of known metaheuristics: simulate...

Algebraic Surface Design and Finite Element Meshes